Formal Proof—Theory and Practice
نویسنده
چکیده
syntax trees almost copying the abstract grammar: type term = Var of string | Fn of string * term list;; and express in a direct recursive way the function returning the set of variables in a term: let rec vars tm =
منابع مشابه
The Primitive Proof Theory of the lambda-Calculus
We consider formal provability with structural induction and related proof principles in the λ-calculus seen as a (functional) programming language, i.e., presented with first-order abstract syntax over one-sorted variable names. Structural induction is the principal primitive proof principle of that particular syntactic framework and it is, indeed, near-ubiquitously employed in informal proofs...
متن کاملIMPS: An Updated System Description
imps, an Interactive Mathematical Proof System, is intended to provide mechanical support for traditional mathematical techniques and styles of practice. The system consists of a library of axiomatic theories and a collection of tools for exploring and extending the mathematics embodied in the theory library. One of the chief tools is a facility for developing formal proofs. imps is equally wel...
متن کاملOnline Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic?
Efficient decision procedures for arithmetic play a very important role in formal verification. In practical examples, however, arithmetic constraints are often mixed with constraints from other theories like the theory of arrays, Boolean satisfiability (SAT), bit-vectors, etc. Therefore, decision procedures for arithmetic are especially useful in combination with other decision procedures. The...
متن کاملModeling Timed Automata Theory in PVS
A mechanized system called FVofTA (Formal Verification of Timed Automata) for specifying and reasoning about real-time systems using TA (Timed Automata) theory in PVS (Prototype Verification System) is proposed in this paper. This system includes two parts: one for modeling real-time system using TA template in PVS and the other for proof intending for formal verification of real-times system. ...
متن کاملFormalization of Shannon’s Theorems Using the Coq Proof-Assistant
概 要 Proofs in information theory can be very technical, to the point that the exposition of details must sometimes be sacrificed for the sake of clarity. The only way to provide complete proofs without impairing understanding is to formalize them with the help of dedicated computer software: proof-assistants. In this tutorial, we demonstrate formal proof for information theory. First, we explai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008